Computability logic

Results: 552



#Item
41Logic programming / Situation calculus / Sheaf / Computability theory

I N F S Y S R E S E A R C H R

Add to Reading List

Source URL: www.kr.tuwien.ac.at

Language: English - Date: 2007-03-24 19:54:28
42Automated theorem proving / Logic programming / Logical truth / Propositional calculus / Substitution / Computability theory / Table of stars with Bayer designations / Symbol

Appendix to Chen et al., ICFPAppendix to Chen et al., Implicit self-adjusting computation for purely functional programs (ICFPIn Section A, we show that translation maps source types to corresponding target

Add to Reading List

Source URL: www.mpi-sws.org

Language: English - Date: 2011-09-08 07:51:15
43Recursion / Theoretical computer science / Mathematical logic / Computability theory / Subroutines / Factorial / This / Recursive definition / While loop

Lecture  14 Recursion Andries van  D am   © 2015  

Add to Reading List

Source URL: cs.brown.edu

Language: English - Date: 2015-10-27 00:27:14
44Predicate logic / Type theory / Logic in computer science / Computability theory / Lambda calculus / Combinatory categorial grammar / Quantifier / Combinatory logic / Parsing / Free variables and bound variables / Weight

Broad-coverage CCG Semantic Parsing with AMR Kenton Lee Luke Zettlemoyer Yoav Artzi∗ Dept. of Computer Science and Cornell Tech Computer Science & Engineering University of Washington Cornell University

Add to Reading List

Source URL: yoavartzi.com

Language: English - Date: 2016-08-12 04:07:46
45Mathematical logic / Mathematics / Computability theory / Logic / Philosophy of mathematics / Foundations of mathematics / Reverse mathematics / Constructivism

Emanuele Frittaion Curriculum Vitae 2016

Add to Reading List

Source URL: www.math.tohoku.ac.jp

Language: English - Date: 2016-05-17 18:40:36
46Proof theory / Computability theory / Logic in computer science / Mathematical logic / Intuitionism / Primitive recursive functional / Dialectica interpretation / Peano axioms / Second-order arithmetic / Reverse mathematics / Combinatory logic / Primitive recursive arithmetic

TERM EXTRACTION AND RAMSEY’S THEOREM FOR PAIRS ALEXANDER P. KREUZER AND ULRICH KOHLENBACH Abstract. In this paper we study with proof-theoretic methods the function(al)s provably recursive relative to Ramsey’s theore

Add to Reading List

Source URL: www.mathematik.tu-darmstadt.de

Language: English - Date: 2013-09-25 08:51:12
47Predicate logic / Computability theory / Recursion / Logic / Theory of computation / Primitive recursive arithmetic / Primitive recursive function / Quantifier / First-order logic / Free variables and bound variables / Herbrandization

A note on the Π02–induction rule∗ Ulrich Kohlenbach Fachbereich Mathematik, J.W.Goethe-Universit¨at, Robert-Mayer-Strasse 6–10, D–60054 Frankfurt, Germany Abstract It is well–known (due to C. Parsons) that th

Add to Reading List

Source URL: www.mathematik.tu-darmstadt.de

Language: English - Date: 2012-11-16 10:10:40
48Computability theory / Theoretical computer science / Mathematical logic / Theory of computation / Mathematics / Model theory / Algorithm characterizations / operator

I NTRODUCTION T HE LST FRAMEWORK Iterative forcing and preservation of hyperimmunity

Add to Reading List

Source URL: ludovicpatey.com

Language: English - Date: 2015-06-30 01:30:45
49Theoretical computer science / Mathematics / Theory of computation / Computability theory / Models of computation / Mathematical logic / Formal methods / Algorithm / Turing machine / Randomized algorithm / IP / Alan Turing

Rooter: A Methodology for the Typical Unification of Access Points and Redundancy Jeremy Stribling, Daniel Aguayo and Maxwell Krohn A BSTRACT Many physicists would agree that, had it not been for congestion control, the

Add to Reading List

Source URL: pdos.csail.mit.edu

Language: English - Date: 2005-04-09 16:37:16
50Mathematics / Theoretical computer science / Computability theory / Mathematical logic / Theory of computation / Turing machine / Models of computation / Busy beaver / Halting problem / ZermeloFraenkel set theory / Computability / Computable function

A Relatively Small Turing Machine Whose Behavior Is Independent of Set Theory Adam Yedidia Scott Aaronson

Add to Reading List

Source URL: www.scottaaronson.com

Language: English - Date: 2016-05-03 08:34:47
UPDATE